منابع مشابه
Experimental Evaluation of Book Drawing Algorithms
Abstract. A k-page book drawing of a graph G = (V,E) consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the k pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if they are assigned to the same page and their vertices alternate along the spine. Crossing minimization in a k-page book drawing is NP-ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Lithic Studies
سال: 2017
ISSN: 2055-0472
DOI: 10.2218/jls.v4i1.2529